A note on complete subdivisions in digraphs of large outdegree
نویسندگان
چکیده
Mader conjectured that for all ` there is an integer δ(`) such that every digraph of minimum outdegree at least δ(`) contains a subdivision of a transitive tournament of order `. In this note we observe that if the minimum outdegree of a digraph is sufficiently large compared to its order then one can even guarantee a subdivision of a large complete digraph. More precisely, let ~ G be a digraph of order n whose minimum outdegree is at least d. Then ~ G contains a subdivision of a complete digraph of order bd/(8n)c.
منابع مشابه
A Note on Directed 5-Cycles in Digraphs
In this note, it is proved that if 0.24817 , then any digraph on n vertices with minimum outdegree at least n contains a directed cycle of length at most 5.
متن کاملA note on the Roman domatic number of a digraph
Roman dominating function} on a digraph $D$ with vertex set $V(D)$ is a labeling$fcolon V(D)to {0, 1, 2}$such that every vertex with label $0$ has an in-neighbor with label $2$. A set ${f_1,f_2,ldots,f_d}$ ofRoman dominating functions on $D$ with the property that $sum_{i=1}^d f_i(v)le 2$ for each $vin V(D)$,is called a {em Roman dominating family} (of functions) on $D$....
متن کاملA note on the query complexity of the Condorcet winner problem
Given an unknown tournament over {1, . . . , n}, we show that the query complexity of the question “Is there a vertex with outdegree n − 1?” (known as a Condorcet winner in social choice theory) is exactly 2n − blog(n)c − 2. This stands in stark contrast to the evasiveness of this property in general digraphs.
متن کاملOn extremal weighted digraphs with no heavy paths
Bollobás and Scott proved that if the weighted outdegree of every vertex of a weighted digraph is at least 1, then it contains a (directed) path of weight at least 1. In this note we characterize the extremal weighted digraphs with no heavy paths. Our result is an extension of a corresponding theorem of Bondy and Fan in weighted graphs. Besides, we give examples showing the invalidity of genera...
متن کاملDigraph Complexity Measures and Applications in Formal Language Theory
We investigate structural complexity measures on digraphs, in particular the cycle rank. This concept is intimately related to a classical topic in formal language theory, namely the star height of regular languages. We explore this connection, and obtain several new algorithmic insights regarding both cycle rank and star height. Among other results, we show that computing the cycle rank is NP-...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 57 شماره
صفحات -
تاریخ انتشار 2008